Simplification of Complexes for Persistent Homology Computations
نویسندگان
چکیده
In this paper we focus on preprocessing for persistent homology computations. We adapt some techniques that were successfully used for standard homology computations. The main idea is to reduce the complex prior to generating its boundary matrix, which is costly to store and process. We discuss the following reduction methods: elementary collapses, coreductions (as defined by Mrozek and Batko), and acyclic subspace methods (introduced by Mrozek, Pilarczyk, and Żelazna).
منابع مشابه
Computing Persistent Homology via Discrete Morse Theory
This report provides theoretical justification for the use of discrete Morse theory for the computation of homology and persistent homology, an overview of the state of the art for the computation of discrete Morse matchings and motivation for an interest in these computations, particularly from the point of view of topological data analysis. Additionally, a new simulated annealing based method...
متن کاملGeneralized Local Homology Modules of Complexes
The theory of local homology modules was initiated by Matlis in 1974. It is a dual version of the theory of local cohomology modules. Mohammadi and Divaani-Aazar (2012) studied the connection between local homology and Gorenstein flat modules by using Gorenstein flat resolutions. In this paper, we introduce generalized local homology modules for complexes and we give several ways for computing ...
متن کاملRepresentability of algebraic topology for biomolecules in machine learning based scoring and virtual screening
This work introduces a number of algebraic topology approaches, including multi-component persistent homology, multi-level persistent homology, and electrostatic persistence for the representation, characterization, and description of small molecules and biomolecular complexes. In contrast to the conventional persistent homology, multi-component persistent homology retains critical chemical and...
متن کاملMultidimensional persistence in biomolecular data
Persistent homology has emerged as a popular technique for the topological simplification of big data, including biomolecular data. Multidimensional persistence bears considerable promise to bridge the gap between geometry and topology. However, its practical and robust construction has been a challenge. We introduce two families of multidimensional persistence, namely pseudomultidimensional pe...
متن کاملMultiresolution Topological Simplification
Persistent homology has been advocated as a new strategy for the topological simplification of complex data. However, it is computationally intractable for large data sets. In this work, we introduce multiresolution persistent homology for tackling large datasets. Our basic idea is to match the resolution with the scale of interest so as to create a topological microscopy for the underlying dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014